Indexing of Multidimensional Lookup Tables in Embedded Systems

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Transbase Hypercube RDBMS: Multidimensional Indexing of Relational Tables

Only few multidimensional access methods have made their way into commercial relational DBMS. Even if a RDBMS ships with a multidimensional index, the multidimensional index usually is an add-on like Oracle SDO, which is not integrated into the SQL interpreter, query processor and query optimizer of the DBMS kernel. Our demonstration shows TransBase HyperCube, a commercial RDBMS, whose kernel f...

متن کامل

Iterating Lookup Tables Efficiently

We show that every function f implemented as a lookup table can, by increasing the storage space by a small constant factor, be implemented such that the computational complexity of evaluating fm(x) is small independently of m and x.

متن کامل

Oblivious Lookup Tables

We consider the following question: given a group-homomorphic public-key encryption E, a ciphertext c = E(x, pk) hiding a value x using a key pk, and a ”suitable” description of a function f , can we evaluate E(f(x), pk) without decrypting c? We call this an oblivious lookup table and show the existence of such a primitive. To this end, we describe a concrete construction, discuss its security ...

متن کامل

Resource and service registration and lookup in cooperating embedded systems

This paper investigates if service registration and lookup could become a usable component in future middlewares for cooperating embedded systems, e.g. wireless sensor networks and automotive networks. As a main part of this investigation, three different traditional middleware architectures have been investigated, focusing on how service registration and lookup is implemented in them. They are...

متن کامل

Level compressed DAGs for lookup tables

Trie-based data structures for implementing IP lookups have attracted considerable research aUention. Techniques such as path compression, level compression, generalized level compression, and controlled prefix expansion are commonly used to implement lookup tables. [0 this paper, we present a fundamentally new technique that relies on directed acyclic graphs (DAGs). which, when coupled with ge...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Image Processing

سال: 2004

ISSN: 1057-7149

DOI: 10.1109/tip.2004.834658